Propagation Rule Compiler : Technical

نویسندگان

  • Rainer Manthey
  • Ulrike Griefahn
  • Thomas Rath
  • Stefano Ceri
چکیده

The Propagation Rule Compiler (PROP) is a tool developed within task 2.4 \Tools for Rule Design and Analysis". It aims at supporting developers of Chimera applications during schema design and prototyping. PROP consists of two components: the rule compiler as such and an explanation facility. The task of the explanation facility is to graphically illustrate the logical dependencies established via deductive rules of a given Chimera schema. The purpose of the compilation unit is to generate update propagation triggers from deductive rules. Such triggers are able to automatically compute all implicit changes of a Chimera database once a speciic updating transaction has been issued. PROP has been integrated as a subcomponent into Bonn's Chimera Prototyping Tool (CPT). The purpose of this document is to provide the technical documentation of the rule compilation process.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propagation Rule Compiler : Technical Documentation

The Propagation Rule Compiler (PROP) is a tool developed within the ES-PRIT III project IDEA (Intelligent Database Environment for Advanced Applications). It aims at supporting developers of Chimera applications during schema design and prototyping. PROP consists of two components: the rule compiler as such and an explanation facility. The task of the explanation facility is to graphically illu...

متن کامل

Propagation Rule Compiler: Evaluation Esprit Project 6333 Propagation Rule Compiler: Evaluation

This document evaluates the Propagation Rule Compiler (PROP) which has been developed at the Univ. of Bonn and continuously improved within the last three years. The purpose of PROP is to analyze all deductive rules of a given Chimera schema implementing derived concepts (attributes, classes, views, and constraints). Based on this analysis it generates triggers which are able to compute all imp...

متن کامل

A Dependency Constraint Grammar for Esperanto

This paper presents a rule-based formalism for dependency annotation within the Constraint Grammar framework, implemented as an extension of the open source CG3 compiler. As a proof of concept we have constructed a complete dependency grammar for Esperanto, building on morphosyntactically annotated input from the EspGram parser. The system is described and evaluated on a test corpus. With a 4% ...

متن کامل

Implementing Monads for C + + Template Metaprograms ∗ Technical report TR -

C++ template metaprogramming is used in various application areas, such as expression templates, static interface checking, active libraries, etc. Its recognized similarities to pure functional programming languages – like Haskell – make the adoption of advanced functional techniques possible. Such a technique is using monads, programming structures representing computations. Using them actions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007